Ancestral Dynamic Voting Algorithm for Mutual Exclusion in Partitioned Distributed Systems
نویسندگان
چکیده
منابع مشابه
A Preliminary Study on Ancestral Voting Algorithm for Availability Improvement of Mutual Exclusion in Partitioned Distributed Systems
Mutual exclusion as one of the main problems associated with distributed systems requires that at any time t, only one site can access the common copies of file f. As a result of node or link failures, distributed system may be partitioned into two or more groups of nodes which cannot communicate each other anymore; meanwhile they must be able to update their copies of file f consistently, in o...
متن کاملA Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
In this paper, we present a dynamic information-structure mutual exclusion algorithm for distributed systems whose informationstructure evolves with time as sites learn about the state of the system through messages. An interesting feature of the algorithm is that it adapts itself to heterogeneous or fluctuating traffic conditions to optimize the performance (the number of messages exchanged). ...
متن کاملA Fault-tolerant Mutual Exclusion Algorithm in Asynchronous Distributed Systems
Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In ...
متن کاملGROUP k-MUTUAL EXCLUSION FOR DISTRIBUTED SYSTEMS
In this paper, we propose an algorithm to solve the group k-mutual exclusion (Gk-ME) problem for distributed systems. The Gk-ME problem is concerned with controlling the concurrent accesses of some resource by at most k nodes with the constraint that no two distinct resources can be accessed simultaneously. The proposed algorithm utilizes a token circulation mechanism and does not require the n...
متن کاملA Fair Distributed Mutual Exclusion Algorithm
ÐThis paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N ÿ 1 and 2 N ÿ 1 messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a deterministic function of concurrency in the comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2013
ISSN: 1550-1477,1550-1477
DOI: 10.1155/2013/120308